Garbled Elections
نویسندگان
چکیده
Majority rules are frequently used to decide whether or not a public good should be provided, but will typically fail to achieve an efficient provision. We provide a worst-case analysis of the majority rule with an optimally chosen majority threshold, assuming that voters have independent private valuations and are ex-ante symmetric (provision cost shares are included in the valuations). We show that if the population is large it can happen that the optimal majority rule is essentially no better than a random provision of the public good. But the optimal majority rule is worst-case asymptotically efficient in the large-population limit if (i) the voters’ expected valuation is bounded away from 0, and (ii) an absolute bound for valuations is known.
منابع مشابه
Reactive Garbling: Foundation, Instantiation, Application
Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and threeparty secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes the syntax and security properties of garbled circuits. We define a generalization of garbling schemes called reactive garbling schemes. We conside...
متن کاملThe Challenges of the Elections Systems of Persian Gulf Arab Countries
This article intends to clarify views regarding important challenges that have originated from the political, social, cultural and geopolitical structures in the elections systems of Persian Gulf Arab countries. Challenges that determine the compatibility levels of elections systems of these countries with the world’s democratic systems. An efficient elections system is the prerequisite for the...
متن کاملFoundations of Reactive Garbling Schemes
Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and three-party secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes the syntax and security properties of garbled circuits. We dene a generalization of garbling schemes called reactive garbling schemes. We conside...
متن کاملGarbled Circuits via Structured Encryption
The garbled circuit technique transforms a circuit in such a way that it can be evaluated on encrypted inputs. Garbled circuits were originally introduced by Yao (FOCS ’86) for the purpose of secure two-party computation but have since found many applications. In this work, we consider the problem of designing special-purpose garbled circuits, which are garbled circuits that handle only a speci...
متن کاملA Gentle Introduction to Yao’s Garbled Circuits
This is a short, gentle introduction to the Yao’s Garbled Circuits construction and recent optimizations, as well as the garbled circuit definitions.
متن کامل